A Segmented Leap-Ahead LFSR Pseudo-Random Number Generator
نویسندگان
چکیده
منابع مشابه
A Reversible LFSR Pseudo-Random Sequences Generator
With the development of science and technology, many testable design methods have been widely studied and applied to improve the quality of IC testing and reduce cost. Built-in self-test (BIST) is a primary self-test methodology and is widely used for testing VLSI circuits. This method configures circuits for testing itself, with the advantage of low test complexity, short test time, high fault...
متن کاملSustainable Pseudo-random Number Generator
Barak and Halevi (BH) have proposed an efficient architecture for robust pseudorandom generators that ensure resilience in the presence of attackers with partial knowledge or partial controls of the generators’ entropy resources. The BH scheme is constructed from the Barak, Shaltiel and Tromer’s randomness extractor and its security is formalized in the simulation-based framework. The BH model ...
متن کاملA Simple Unpredictable Pseudo-Random Number Generator
Two closely-related pseudo-random sequence generators are presented: The lIP generator, with input P a prime, outputs the quotient digits obtained on dividing by P. The x mod N generator with inputs N, Xo (where N P. Q is a product of distinct primes, each congruent to 3 mod 4, and x0 is a quadratic residue mod N), outputs bob1 b2" where bi parity (xi) and xi+ x mod N. From short seeds each gen...
متن کاملA practical “perfect” pseudo-random number generator
The “x2 mod N” generator, also known as the BBS generator [2], has a strong theoretical foundation from the computational complexity theory and the number theory. Proofs were given that, under certain reasonable assumptions on which modern cryptography heavily relies, the BBS pseudo-random sequences would pass any feasible statistical test. Unfortunately, the algorithm was found to be too slow ...
متن کاملA Pseudo Random Number Generator from Chaos
A random number generator is proposed based on a theorem about existence of chaos in fixed point iteration of xn = cot(xn−1). Digital computer simulation of this function iteration exhibits random behavior. A method is proposed to extract random bytes from this simulation. Diehard and NIST test suite for randomness detection is run on this bytes, and it is found to pass all the tests in the sui...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Korea Institute of Information Security and Cryptology
سال: 2014
ISSN: 1598-3986
DOI: 10.13089/jkiisc.2014.24.1.51